Toward Recovering Allele-specific Cancer Genome Graphs
نویسندگان
چکیده
منابع مشابه
Title: Allele-specific Disparity in Breast Cancer
This paper presented the authors' search for allele-specific disparity in breast cancer using paired blood tumor samples from a large cohort of breast cancer patients in different stages. Using a workflow/algorithm developed in this paper using B-allele frequency and log R ratio of Illumina SNP data to estimate Euclidean distances, the authors were able to detect SNPs with substantial differenc...
متن کاملEstimating Genome-Wide Copy Number Using Allele Specific Mixture Models
Genomic changes such as copy number alterations are one of the major underlying causes of human phenotypic variation among normal and disease subjects. Array comparative genomic hybridization (CGH) technology was developed to detect copy number changes in a high-throughput fashion. However, this technology provides only a >30-kb resolution, which limits the ability to detect copy number alterat...
متن کاملGenome-wide allele- and strand-specific expression profiling
Recent reports have shown that most of the genome is transcribed and that transcription frequently occurs concurrently on both DNA strands. In diploid genomes, the expression level of each allele conditions the degree to which sequence polymorphisms affect the phenotype. It is thus essential to quantify expression in an allele- and strand-specific manner. Using a custom-designed tiling array an...
متن کاملUtilising polymorphisms to achieve allele-specific genome editing in zebrafish
The advent of genome editing has significantly altered genetic research, including research using the zebrafish model. To better understand the selectivity of the commonly used CRISPR/Cas9 system, we investigated single base pair mismatches in target sites and examined how they affect genome editing in the zebrafish model. Using two different zebrafish strains that have been deep sequenced, CRI...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2018
ISSN: 1557-8666
DOI: 10.1089/cmb.2018.0022